Exploration in Stochastic Algorithms: An Application on MAX-MIN Ant System
نویسندگان
چکیده
In this paper a definition of the exploration performed by stochastic algorithms is proposed. It is based on the observation through cluster analysis of the solutions generated during a run. The probabilities associated by an algorithm to solution components are considered. Moreover, a consequent method for quantifying the exploration is provided. Such a measurement is applied toMAX–MIN Ant System. The results of the experimental analysis allow to observe the impact of the parameters of the algorithm on the exploration.
منابع مشابه
Reactive Max-min Ant System: an Experimental Analysis of the Combination with K-opt Local Searche
Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. The exploration versus exploitation dilemma rises in ACO search. Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation. It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary explora...
متن کاملOn the Explorative Behavior of MAX-MIN Ant System
Abstract Analyzing the behavior of stochastic procedures is generally recognized to be relevant. A possible way for doing so consists in observing the exploration performed. A formalization in this sense is proposed in the paper On the explorative behavior of MAX–MIN Ant System : A method for studying this aspect regardless the type of approach used is defined and tested. The consequent measure...
متن کاملImproving the Ant System : A Detailed Report on theMAX { MIN Ant
Ant System is a general purpose heuristic algorithm inspired by the foraging behavior of real ant colonies. Here we introduce an improved version of Ant System, that we called MAX{ MIN Ant System. We describe the new features present in MAX{MIN Ant System, make a detailed experimental investigation on the contribution of the design choices to the improved performance and give computational resu...
متن کاملImproved Lower Limits for Pheromone Trails in Ant Colony Optimization
Ant Colony Optimization algorithms were inspired by the foraging behavior of ants that accumulate pheromone trails on the shortest paths to food. Some ACO algorithms employ pheromone trail limits to improve exploration and avoid stagnation by ensuring a non-zero probability of selection for all trails. The MAX-MIN Ant System (MMAS) sets explicit pheromone trail limits while the Ant Colony Syste...
متن کاملImproving the Ant System :
Ant System is a general purpose heuristic algorithm inspired by the foraging behavior of real ant colonies. Here we introduce an improved version of Ant System, that we called MAX{ MIN Ant System. We describe the new features present in MAX{MIN Ant System, make a detailed experimental investigation on the contribution of the design choices to the improved performance and give computational resu...
متن کامل